A note on hyperopic cops and robber

نویسندگان

چکیده

In this paper, we explore a variant of the game Cops and Robber introduced by Bonato et al. where robber is invisible unless outside common neighborhood cops. The hyperopic cop number analogous to investigate bounds on quantity. We define small set relate minimum cardinality graph parameter number. consider diameter [Formula: see text] graphs, particularly join two as well Cartesian products.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hyperopic Cops and Robbers

We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the corresponding analogue of the cop number, and we investigate bounds and other properties of this parameter. We characterize the cop-win graphs for this variant, along with graphs with the largest possible hyperopic c...

متن کامل

Cops, Robber, and Alarms

The two games considered are mixtures of Searching and Cops and Robber. The cops have partial information, provided first via selected vertices of a graph, and then via selected edges. This partial information includes the robber's position, but not the direction in which he is moving. The robber has perfect information. In both cases, we give bounds on the amount of such information required b...

متن کامل

Cops and robber on grids and tori

This paper is a contribution to the classical cops and robber problem on a graph, directed to two-dimensional grids and toroidal grids. These studies are generally aimed at determining the minimum number of cops needed to capture the robber and proposing algorithms for the capture. We apply some new concepts to propose a new solution to the problem on grids that was already solved under a diffe...

متن کامل

Cops, Robber and Medianwidth Parameters

In previous work, we introduced median decompositions of graphs, a generalisation of tree decompositions where a graph can be modelled after any median graph, along with a hierarchy of i-medianwidth parameters (mwi)i≥1 starting from treewidth and converging to the clique number. We introduce another graph parameter based on the concept of median decompositions, to be called i-latticewidth and d...

متن کامل

Cops and Robber with Constraints

Cops & Robber is a classical pursuit-evasion game on undirected graphs, where the task is to identify the minimum number of cops sufficient to catch the robber. In this paper, we investigate the changes in problem’s complexity and combinatorial properties with constraining the following natural game parameters • Fuel : The number of steps each cop can make; • Cost : The total sum of steps along...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics, Algorithms and Applications

سال: 2022

ISSN: ['1793-8309', '1793-8317']

DOI: https://doi.org/10.1142/s1793830922501270